Kernel conditional clustering and kernel conditional semi-supervised learning
نویسندگان
چکیده
منابع مشابه
Composite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملKernel conditional random fields : representation, clique selection, and semi-supervised learning
Kernel conditional random fields are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models is given which shows how kernel conditional random fields arise from risk minimization procedures defined using Mercer kernels on labeled graphs. A procedure for greedily selecting cliques in the dual representation is then p...
متن کاملSemi-supervised deep kernel learning
Deep learning techniques have led to massive improvements in recent years, but large amounts of labeled data are typically required to learn these complex models. We present a semi-supervised approach for training deep models that combines the feature learning capabilities of neural networks with the probabilistic modeling of Gaussian processes and demonstrate that unlabeled data can significan...
متن کاملSemi-supervised clustering with metric learning: An adaptive kernel method
Most existing representative works in semi-supervised clustering do not sufficiently solve the violation problem of pairwise constraints. On the other hand, traditional kernel methods for semi-supervised clustering not only face the problem of manually tuning the kernel parameters due to the fact that no sufficient supervision is provided, but also lack a measure that achieves better effectiven...
متن کاملSemi-Supervised Learning Using Kernel Spectral Clustering Core Model
A multi-class semi-supervised learning algorithm formulated as a regularized kernel spectral clustering (KSC) approach is proposed. The method is bale to address both semi-supervised classification and clustering. In addition a low embedding dimension is utilized to reveal the existing number of clusters. Thanks to the Nyström approximation technique, the approach can be scaled up for analyzing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Knowledge and Information Systems
سال: 2019
ISSN: 0219-1377,0219-3116
DOI: 10.1007/s10115-019-01334-5